On Movement-based Location Update in Nonhomogeneous Topologies of Multitier PCS Networks

نویسنده

  • Jung-Tsung Tsai
چکیده

We investigates the performance of movement-based location update in multitier wireless networks with sparsely correlated low-tier microcells. The topologies are considered to have random overlays of different microcell cluster sizes, with distributions spatially of two forms: homogeneous and nonhomogeneous. Permission for a mobile station (MS) to report to either a low-tier microcell or a high-tier macrocell is determined by the state of macrocell-based movement counter compared with two thresholds. The higher threshold is fixed but the lower threshold is either static or adaptive with a value optimized for an MS roaming everywhere or locally, respectively. Results from simulations on basis of user mobility of memoryless random walk between microcells suggest that given an average density of accessible microcells, each location update scheme in topologies of nonhomogeneous distributions or random overlays of large cluster sizes yields a higher optimal total location update cost per call arrival; that the adaptive scheme is able to gain cost advantages over a corresponding static one only in nonhomogeneous topologies; and that the schemes by using one more buffer space for the previous visited macrocell ID effectively reduce many unnecessary location updates.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An adaptive distance-based location update algorithm for next-generation PCS networks

In this paper, we propose a stochastic model to compute the optimal update boundary for the distance-based location update algorithm. The proposed model is flexible and captures some of the real characteristics in the wireless cellular environment. The model can adapt to arbitrary cell topologies in which the number of neighboring base stations at different locations may vary. The cell residenc...

متن کامل

An adaptive distance-based location update algorithm for PCS networks

In this paper, we propose a stochastic model to compute the optimal update boundary for the distance-based location update algorithm. The proposed model captures some of the real characteristics in the wireless cellular environment. The model can adapt to arbitrary cell topologies in which the number of neighboring base stations at different locations may vary. The cell residence time can follo...

متن کامل

Optimal Dynamic Mobility Management for PCS Networks

-We study a dynamic mobility management scheme: the movement-based location update scheme. An analytical model is applied to formulate the costs of location update and paging in the movement-based location update scheme. The problem of minimizing the total cost is formulated as an optimization problem that finds the optimal threshold in the movement-based location update scheme. We prove that t...

متن کامل

A dynamic location management scheme for next-generation multitier PCS systems

Global wireless networks enable mobile users to communicate regardless of their locations. One of the most important issues is location management in a highly dynamic environment because mobile users may roam between different wireless systems, network operators, and geographical regions. In this paper, a location-tracking mechanism is introduced that consists of intersystem location updates an...

متن کامل

Location Management Cost for Dynamic Location Update and Paging for Pcs Networks

The standard technique for cellular networks is to decrease radio cell size, thereby maintaining a supportable subscriber density. However, smaller cell sizes result in increased signaling for location management procedures, which reduces the bandwidth available for user traffic and increases the cost. A dynamic distance-based location update with sequential paging with no delay constraint algo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003